Rendezvous Data Collection Using a Mobile Element in Heterogeneous Sensor Networks

We study the rendezvous data collection problem for the Mobile Element (ME) in heterogeneous sensor networks where data generation rates of sensors are distinct. Different from previous efforts, the link quality is instable in our network model and the sensory data cannot be aggregated when transmitting. We introduce to optimize the energy consumption on gathering the global data named In-network communication cost. By doing so, the Mobile Element is able to efficiently collect network wide data within a given delay bound meanwhile the network eliminates the energy bottleneck to prolong its lifetime. For case study, we consider the trajectory planning for both Mobile Relay and Mobile Sink on a tree-shaped network. In the Mobile Relay case where the ME’s trajectory must pass through a given point to upload sensory data, an ( lg ) O n n algorithm named RP-MR is proposed to approach 1: the optimal Rendezvous Points (RPs) to collect global sensory data; 2: the optimal data collection trajectory for the Mobile Relay to gather the cached data from RPs and upload to a fixed point for further processing, i.e., the sink. In the Mobile Sink case where the Mobile Element can processing the sensory on its motion, we develop an 2 ( lg ) O n n algorithm named RP-MS to recursively investigate the optimal solution. Both the theoretical analysis and extensive simulations verify the correctness and effectiveness of proposals.